Evolutionary Approaches to Expensive Optimisation
نویسنده
چکیده
Surrogate assisted evolutionary algorithms (EA) are rapidly gaining popularity where applications of EA in complex real world problem domains are concerned. Although EAs are powerful global optimizers, finding optimal solution to complex high dimensional, multimodal problems often require very expensive fitness function evaluations. Needless to say, this could brand any population-based iterative optimization technique to be the most crippling choice to handle such problems. Use of approximate model or surrogates provides a much cheaper option. However, naturally this cheaper option comes with its own price! This paper discusses some of the key issues involved with use of approximation in evolutionary algorithm, possible best practices and solutions. Answers to the following questions have been sought: what type of fitness approximation to be used; which approximation model to use; how to integrate the approximation model in EA; how much approximation to use; and how to ensure reliable approximation. Keywords—Optimization; Evolutionary Algorithm, Approximation Model; Fitness Approximation; Meta-model; Surrogate
منابع مشابه
A Multi-fidelity Based Adaptive Sampling Optimisation Approach for the Rapid Design of Double-negative Metamaterials
Due to the increasing complexity of metamaterial geometric structures, direct optimisation of these designs using conventional approaches, such as Gradient-based and evolutionary algorithms, are often impractical and limited. This is in part due to the inherently high computational cost associated with running multiple expensive high-fidelity full-wave simulations, commonly required to optimise...
متن کاملThe N-Tuple Bandit Evolutionary Algorithm for Game Agent Optimisation
This paper describes the N-Tuple Bandit Evolutionary Algorithm (NTBEA), an optimisation algorithm developed for noisy and expensive discrete (combinatorial) optimisation problems. The algorithm is applied to two game-based hyperparameter optimisation problems. The N-Tuple system directly models the statistics, approximating the fitness and number of evaluations of each modelled combination of p...
متن کاملA Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation
Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaini...
متن کاملMemetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex continuous optimisation problems. There exists a group of continuous local search algorithms that stand out as exceptional local search optimisers. However, on some occasions, they may become very expensive, because of the...
متن کاملEmergency department resource optimisation for improved performance: a review
Emergency departments (EDs) have been becoming increasingly congested due to the combined impacts of growing demand, access block and increased clinical capability of the EDs. This congestion has known to have adverse impacts on the performance of the healthcare services. Attempts to overcome with this challenge have focussed largely on the demand management and the application of system wide p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1303.2745 شماره
صفحات -
تاریخ انتشار 2013